#include<stdio.h>

int holediv(long long int num_input,long long int *pn,int i);


int main(void){
	long long int   input=2,num_input=2;
	scanf("%ld",&num_input);
	long i=2;
	int j=0;
	int cou=0;
	input=num_input;
	int count[100]={0},primes[100]={0};
	for (;i<=input;i++){
		long t;
		if(t=holediv(input,&input,i)){
			
			count[cou]=t;
			primes[cou]=i;
			cou++;
			
			
		}
	
	
	}
	if(num_input==primes[0]){
		printf("%d",num_input);
	}else{
		
		printf("%d=%d",num_input,primes[0]);
		count[0]--;
		for(;j<100;j++){
		

			while(count[j]--){
				printf("x%d",primes[j]);
			
				}
			}
		}
	return 0; 
	
	}
 
int holediv(long long int num,long long int *pn,int in){
	int counti=0;
	while(num%in==0){
		num/=in;
		counti++;
	}
	*pn=num;
	return counti;
}
